Some Basic Data Structures and Algorithms for Chemical Generic Programming
نویسندگان
چکیده
منابع مشابه
Some Basic Data Structures and Algorithms for Chemical Generic Programming
Here, we report a template library used for molecular operation, the Molecular Handling Template Library (MHTL). The library includes some generic data structures and generic algorithms, and the two parts are associated with each other by two concepts: Properties and Molecule. The concept Properties describes the interface to access objects' properties, and the concept Molecule describes the mi...
متن کاملBasic Introduction into Algorithms and Data Structures
This chapter gives a brief introduction into basic data structures and algorithms, together with references to tutorials available in the literature. We first introduce fundamental notation and algorithmic concepts. We then explain several sorting algorithms and give small examples. As fundamental data structures, we introduce linked lists, trees and graphs. Implementations are given in the pro...
متن کاملAlgorithms and Data Structures: The Basic Toolbox
I appreciate the way in which at the end of each chapter two paramount topics integrated i.e. Implementation Notes and Historical Notes and Further Findings. In addition, every chapter starts with the requirements or importance of respective topic. This is helpful from the view of an undergraduate student to study the topic. Also, the appendix at the end is very helpful for reading and understa...
متن کاملGeneric Components for Grid Data Structures and Algorithms with C++
Grids are fundamental data structures for representing geometric structures or their subdivisions. We propose a strategy for decoupling algorithms working on grids from the details of grid representations, using a generic programming approach in C++. Functionality of grid data structures is captured by a small set of primitives, divided into combinatorial and geometric ones. Special attention i...
متن کاملNotes on Dynamic Programming Algorithms & Data Structures
The technique of Dynamic Programming (DP) could be described “recursion turned upside-down”. However, it is not usually used as an alternative to recursion. Rather, dynamic programming is used (if possible) for cases when a recurrence for an algorithmic problem will not run in polynomial-time if it is implemented recursively. So in fact Dynamic Programming is a morepowerful technique than basic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Information and Computer Sciences
سال: 2004
ISSN: 0095-2338
DOI: 10.1021/ci049938s